Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems
نویسندگان
چکیده
A disjoint NP-pair is a pair (A,B) of nonempty, disjoint sets A and B such that both A and B belong to the complexity class NP.1 We let DisjNP denote the collection of all disjoint NP-pairs. A separator of a disjoint NP-pair (A,B) is a set S such that A ⊆ S and B ⊆ S (Figure 1). A fundamental question is whether (A,B) has a separator belonging to P. In this case the pair is P-separable; otherwise, it is P-inseparable.
منابع مشابه
Tuples of Disjoint NP-Sets
Disjoint NP-pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity. In this paper we introduce a natural generalization of the notion of disjoint NP-pairs to disjoint k-tuples of NP-sets for k ≥ 2. We define subclasses of the class of all disjoint k-tuples of NP-sets. These subclasses are associated with a proposition...
متن کاملCanonical Disjoint NP-Pairs of Propositional Proof Systems
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure of the class of disjoint NP-pairs and of all canonical pairs is identical. Secondly, we show that this degree structure is not superficial: Assuming there exist P-inseparable disjoint pairs, there exist intermediate di...
متن کاملClasses of Representable Disjoint NP - Pairs 1
For a propositional proof system P we introduce the complexity class DNPP(P ) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make canonical NP-pairs associated with these proof systems hard or complete for DNPP(P ). Moreover, we demonstrate that non-equivalent proof systems c...
متن کاملClasses of representable disjoint NP-pairs
For a propositional proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make canonical NP-pairs associated with these proof systems hard or complete for DNPP(P). Moreover, we demonstrate that nonequivalent proof systems can ...
متن کاملProof system representations of degrees of disjoint NP-pairs
Let D be a set of many-one degrees of disjoint NP-pairs. We define a proof system representation of D to be a set of propositional proof systems P such that each degree in D contains the canonical NP-pair of a corresponding proof system in P and the degree structure of D is reflected by the simulation order among the corresponding proof systems in P. We also define a nesting representation of D...
متن کامل